Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
921	ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-07-19 19:14:33 Mathematics Computer science Computable function Recursive set Recursively enumerable set Enumeration Generic-case complexity Halting problem Low Computability theory Theory of computation Theoretical computer science
922	ASYMPTOTIC DENSITY AND THE ERSHOV HIERARCHY ROD DOWNEY, CARL JOCKUSCH, TIMOTHY H. MCNICHOLL, AND PAUL SCHUPP Abstract. We classify the asymptotic densities of the ∆02 sets according to their level in the Ershov hierarc Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2014-02-03 11:22:38 Field theory Computable number Real closed field Natural density Recursively enumerable set Limit superior and limit inferior Itō diffusion Mathematics Theory of computation Computability theory
923	DIAGONALLY NON-COMPUTABLE FUNCTIONS AND BI-IMMUNITY CARL G. JOCKUSCH, JR. AND ANDREW E.M. LEWIS Abstract. We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-02 15:47:48 Applied mathematics Computable function Turing reduction Reduction Algorithmically random sequence Function Computability theory Mathematics Computer science
924	RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:59:20 Logic Theory of computation Congruence lattice problem Mathematics Computability theory Forcing
925	ASYMPTOTIC DENSITY, COMPUTABLE TRACEABILITY, AND 1-RANDOMNESS URI ANDREWS, MINGZHONG CAI, DAVID DIAMONDSTONE, CARL JOCKUSCH, AND STEFFEN LEMPP Abstract. Let r be a real number in the unit interval [0, 1]. A set A ⊆ ω Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2014-02-03 11:22:22 Mathematics Computable function Algorithmically random sequence Busy beaver Theory of computation Computability theory Applied mathematics
926	ERRATA FOR “ON THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS” PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND THEODORE A. SLAMAN Several proofs given in [2] contain significant errors or gaps, although Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-08-16 22:19:13 Year of birth missing Turing degree Mathematics Mathematical logic Logic Proof theory Computability theory Carl Jockusch Place of birth missing
927	32 THE JOURNAL OF UNDERGRADUATE RESEARCH IN PHYSICS PREPARING A MANUSCRIPT FOR PUBLICATION Rexford E. Adelberger, Editor Add to Reading List Source URL: www.jurp.org Language: English - Date: 2012-01-18 16:26:21 Science Abstract Academia Technology Knowledge Computability theory Formal methods Models of computation Evidence-based nursing Technical communication Scientific journal Mathematics
928	Church Numerals Amazingly, any function that can be computed at all, such as factorial(5) or sqrt(7) or piglatin(Scratch), can be computed using only and . The study of how to do this is "lambda calculus," a mathematical Add to Reading List Source URL: byob.berkeley.edu Language: English - Date: 2010-05-10 03:05:25 Lambda calculus Computability theory Subroutines Theoretical computer science Functional programming Function Church encoding Calculus Eval Software engineering Computing Mathematics
929	Applied Mathematics and Computation xxx[removed]xxx–xxx Contents lists available at ScienceDirect Applied Mathematics and Computation journal homepage: www.elsevier.com/locate/amc Add to Reading List Source URL: scribblethink.org Language: English - Date: 2012-11-02 20:38:30 Applied mathematics Theory of computation Randomness Algorithmic information theory Information theory Kolmogorov complexity Algorithmically random sequence Complexity Computable function Theoretical computer science Mathematics Computability theory
930	THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:55:43 Mathematics Theory of computation PA degree Computable function Reverse mathematics Model theory Forcing Combinatory logic Primitive recursive function Computability theory Mathematical logic Theoretical computer science

UPDATE